Back to course home
0% completed
Vote For New Content
Google Medium
Gray Code (medium)
Solution: Gray Code
2 Keys Keyboard (medium)
Solution: 2 Keys Keyboard
Arithmetic Slices (medium)
Solution: Arithmetic Slices
Unique Length-3 Palindromic Subsequences (medium)
Solution: Unique Length-3 Palindromic Subsequences
Minimum Difference Between Largest and Smallest Value in Three Moves (medium)
Solution: Minimum Difference Between Largest and Smallest Value in Three Moves
Letter Combinations of a Phone Number (medium)
Solution: Letter Combinations of a Phone Number
01 Matrix (medium)
Solution: 01 Matrix
Maximum Points You Can Obtain from Cards (medium)
Solution: Maximum Points You Can Obtain from Cards
Strobogrammatic Number II (medium)
Solution: Strobogrammatic Number II
Maximum Length of Semi-Decreasing Subarrays (medium)
Solution: Maximum Length of Semi-Decreasing Subarrays
Minimum Area Rectangle (medium)
Solution: Minimum Area Rectangle
Count Unreachable Pairs of Nodes in an Undirected Graph (medium)
Solution: Count Unreachable Pairs of Nodes in an Undirected Graph
Single Number II (medium)
Solution: Single Number II
4Sum II (medium)
Solution: 4Sum II
Furthest Building You Can Reach (medium)
Solution: Furthest Building You Can Reach
Minimizing Array After Replacing Pairs With Their Product (medium)
Solution: Minimizing Array After Replacing Pairs With Their Product
Fair Distribution of Cookies (medium)
Solution: Fair Distribution of Cookies
Find Leaves of Binary Tree (medium)
Solution: Find Leaves of Binary Tree
Rotate Image (medium)
Solution: Rotate Image
Combination Sum (medium)
Solution: Combination Sum
Implement Trie (Prefix Tree) (medium)
Solution: Implement Trie (Prefix Tree)
Number of Islands (medium)
Solution: Number of Islands
Edit Distance (medium)
Solution: Edit Distance
Container With Most Water (Medium)
Solution: Container With Most Water
Meeting Rooms II (medium)
Solution: Meeting Rooms II
Google Hard
Shortest Subarray with Sum at Least K (hard)
Solution: Shortest Subarray with Sum at Least K
Reverse Pairs (hard)
Solution: Reverse Pairs
Nth Magical Number (hard)
Solution: Nth Magical Number
Candy (hard)
Solution: Candy
Arithmetic Slices II - Subsequence (hard)
Solution: Arithmetic Slices II - Subsequence
Burst Balloons (hard)
Solution: Burst Balloons
Sum of Distances in Tree (hard)
Solution: Sum of Distances in Tree
Maximum Score of a Good Subarray (hard)
Solution: Maximum Score of a Good Subarray
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
How Many Numbers Are Smaller Than the Current Number (easy)
Problem Statement
Given an integer array nums, return the answer array where answer[i] is the count of smaller elements than nums[i].
Examples
-
Example 1:
- Input: nums =
[5, 3, 6, 1, 4] - Expected Output:
[3, 1, 4, 0, 2] - Justification: For the first element (5), there are three elements (3,1 and 4) that are smaller. For the second element (3), there is one element (1) smaller than it. For (6), there are four elements smaller than it. For (1), there are no smaller elements, and for (4), there are two elements (3 and 1) that are smaller.
- Input: nums =
-
Example 2:
- Input: nums =
[6, 6, 6, 6, 6] - Expected Output:
[0, 0, 0, 0, 0] - Justification: Each element is equal to the others, so there are no elements smaller than any given element.
- Input: nums =
-
Example 3:
- Input: nums =
[1, 2, 3, 4, 5] - Expected Output:
[0, 1, 2, 3, 4] - Justification: This is a strictly increasing sequence. Each number has all the previous numbers in the sequence smaller than itself.
- Input: nums =
Try it yourself
Try solving this question here:
Java
Saved to Cloud
. . . .
Solution: Find the Difference
Solution: How Many Numbers Are Smaller Than the Current Number
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself